Checking EMTLK Properties of Timed Interpreted Systems Via Bounded Model Checking
نویسندگان
چکیده
منابع مشابه
Checking EMTLK properties of timed interpreted systems via bounded model checking
We investigate a SAT-based bounded model checking (BMC) method for EMTLK (the existential fragment of the metric temporal logic with knowledge) that is interpreted over timed models generated by timed interpreted systems. In particular, we translate the existential model checking problem for EMTLK to the existential model checking problem for a linear temporal logic (called HLTLK), and we provi...
متن کاملBounded Model Checking for Deontic Interpreted Systems
We propose a framework for the verification of multi-agent systems’ specification by symbolic model checking. The language CTLKD (an extension of CTL) allows for the representation of the temporal evolution of epistemic states of the agents, as well as their correct and incorrect functioning behaviour. We ground our analysis on the semantics of deontic interpreted systems. The verification appr...
متن کاملBounded Model Checking for Timed Systems
Enormous progress has been achieved in the last decade in the verification of timed systems, making it possible to analyze significant real-world protocols. An open challenge is the identification of fully symbolic verification techniques, able to deal effectively with the finite state component as well as with the timing aspects. In this paper we propose a new, symbolic verification technique ...
متن کاملChecking MTL Properties of Discrete Timed Automata via Bounded Model Checking
We investigate a SAT-based bounded model checking (BMC) method for MTL (metric temporal logic) that is interpreted over linear discrete infinite time models generated by discrete timed automata. In particular, we translate the existential model checking problem for MTL to the existential model checking problem for a variant of linear temporal logic (called HLTL), and we provide a SAT-based BMC ...
متن کاملBounded versus Unbounded Model Checking for Interpreted Systems⋆
This paper addresses the problem of verification of multiagent systems by means of symbolic model checking. It is shown how to adapt the techniques of bounded and unbounded model checking to verify temporal epistemic properties of multi-agent systems. We give details of these two techniques for the logic that extends CTLK by past modalities, and show how it can be applied to the well known trai...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Studia Logica
سال: 2015
ISSN: 0039-3215,1572-8730
DOI: 10.1007/s11225-015-9637-9